Semantics and expressiveness of ordered SOS
نویسندگان
چکیده
منابع مشابه
Semantics and expressiveness of ordered SOS
Structured Operational Semantics (SOS) is a popular method for defining semantics by means of transition rules. An important feature of SOS rules is negative premises, which are crucial in the definitions of such phenomena as priority mechanisms and time-outs. However, the inclusion of negative premises in SOS rules also introduces doubts as to the preferred meaning of SOS specifications. Order...
متن کاملLogic Programs with Ordered Disjunction: First-Order Semantics and Expressiveness
Logic programs with ordered disjunction (LPODs) (Brewka 2002) generalize normal logic programs by combining alternative and ranked options in the heads of rules. It has been showed that LPODs are useful in a number of areas including game theory, policy languages, planning and argumentations. In this paper, we extend propositional LPODs to the first-order case, where a classical second-order fo...
متن کاملThe Meaning of Ordered SOS
Structured Operational Semantics (SOS) is a popular method for defining semantics by means of deduction rules. An important feature of deduction rules, or simply SOS rules, are negative premises, which are crucial in the definitions of such phenomena as priority mechanisms and time-outs. Orderings on SOS rules were proposed by Phillips and Ulidowski as an alternative to negative premises. The m...
متن کاملCausal networks: semantics and expressiveness
Dependency knowledge of the form "x is independent ofy once z is known" invariably obeys the four graphoid axioms, examples include probabilistic and database dependencies. Often, such knowledge can be represented efficiently with graphical structures such as undirected graphs and directed acyclic graphs (DAGs). In this paper we show that the graphical criterion called d-separation is a sound r...
متن کاملChain graphs: semantics and expressiveness
A chain graph (CG) is a graph admitting both directed and undirected edges with forbidden directed cycles. It generalizes both the concept of undirected graph (UG) and the concept of directed acyclic graph (DAG). CGs can be used eeciently to store graphoids, that is, independency knowledge of the form \X is independent of Y given Z" obeying a set of ve properties (axioms). Two equivalent criter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2009
ISSN: 0890-5401
DOI: 10.1016/j.ic.2007.11.008